SubCircuit Extraction with SubGraph Isomorphism
نویسنده
چکیده
The objective of this paper is to demonstrate the practice of the SubGraph Isomorphism (SGI) algorithm on solving the problem of SubCircuit Extraction (SCE). The netlist representation of circuits is discussed first because it has caused the dilemma to the existing SCE approach. Then, based on mapping focus of Edge Unit (EU), an algorithmic solution is exhibited to fulfill the void of circuit comparison in netlist, which is a Hyper Graph structure. In general, by integrating a set of heuristic strategies, a novel planning approach (vs. current searching approaches) for SCE is presented with the advantages of eliminating the non-isomorphic solutions in the early stages and minimizing the number of backtracks on multiple decisions. Therefore, a linear matching time performance of the SCE algorithm is achievable, to the testing circuits that possess EU local distinguishability.
منابع مشابه
Graph matching: filtering databases of graphs using machine learning techniques
Graphs are a powerful concept useful for various tasks in science and engineering. In applications such as pattern recognition and information retrieval, object similarity is an important issue. If graphs are used for object representation, then the problem of determining the similarity of objects turns into the problem of graph matching. Some of the most common graph matching paradigms include...
متن کاملBiological event extraction using subgraph matching
An important task in biological information extraction is to identify descriptions of biological relations and events involving genes or proteins. We propose a graph-based approach to automatically learn rules for detecting biological events in the literature. The detection is performed by searching for isomorphism between event rules and the dependency graphs of complete sentences. When applyi...
متن کاملA Convex Relaxation Bound for Subgraph Isomorphism
In this work a convex relaxation of a subgraph isomorphism problem is proposed, which leads to a new lower bound that can provide a proof that a subgraph isomorphism between two graphs can not be found. The bound is based on a semidefinite programming relaxation of a combinatorial optimisation formulation for subgraph isomorphism and is explained in detail. We consider subgraph isomorphism prob...
متن کاملReductions of Graph Isomorphism Problems
We present a reduction between subgraph isomorphism and minimal partial subgraph isomorphism. We also provide a new reduction between graph isomorphism and minimal partial graph isomorphism. The new reduction is more efficient and simpler than the previous reduction and can be generalized to subgraph isomorphism. In addition, we show that a reduction from graph isomorphism that makes only one c...
متن کاملData Dependent Circuit for Subgraph Isomorphism Problem
The subgraph isomorphism problem has various important applications, although it is generally NP-complete and difficult to solve. This paper examines the feasibility of a data dependent circuit for the subgraph isomorphism problem, which is particularly suitable for FPGA implementation. For graphs of 32 vertices, the average logic scale of data dependent circuits is only 5% of the corresponding...
متن کامل